Optimal reconfiguration of optimal ladder lotteries

نویسندگان

چکیده

A ladder lottery, known as “Amidakuji” in Japan, is a common way to decide an assignment at random. lottery L of given permutation optimal if has the minimum number horizontal lines. In this paper, we investigate reconfiguration problem lotteries. The on set lotteries asks, two L,L? ?, find sequence ?L1,L2,…,Lk? ? such that (1) L1=L and Lk=L? (2) Li for i=2,3,…,k obtained from Li?1 by moving bar locally. An existing result implies any have length O(n3), where n elements ?. characterize sequences between Moreover, present linear-time algorithm computes length.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Resource Allocation with Budgets: Optimal Stable Allocations and Optimal Lotteries∗

We introduce the resource allocation problem where a planner needs to purchase differ-ent resources from providers of different qualities and costs, and the planner allocates the re-sources/providers to consumers with different preferences. The planner has a budget that limitshow much he can spend on the resources. He wants to maximize the social welfare generatedfrom the co...

متن کامل

On the Optimal Design of Lotteries

In recent years the Expected Utility model of choice under risk has been generalized to cope with phenomena such as probability weighting. In the present paper, one such generalized approach, the Rank-Dependent Expected Utility model, is applied to the problem of lottery gambling. The model is used to derive an optimal prize structure for lotteries, involving a few large prizes and a large numb...

متن کامل

Optimal ladder-based biorthogonal coder

In this paper, a novel minimumnoise structure is introduced for ladder-based biorthogonal lter banks. The proposed MInimum Noise LAdder-based Biorthogornal (MINLAB) coder ensures that the noise gain of the quantizers is unity, even though the system is not orthonormal. The coding gain of the optimal MINLAB coder is always greater than unity. For both the AR(1) and MA(1) processes, the MINLAB co...

متن کامل

Using lotteries to approximate the optimal revenue

There has been much recent work on the revenue-raising properties of truthful mechanisms for selling goods to selfish bidders. Typically the revenue of a mechanism is compared against a benchmark (such as, the maximum revenue obtainable by an omniscient seller selling at a fixed price to at least two customers), with a view to understanding how much lower the mechanism’s revenue is than the ben...

متن کامل

Efficient Enumeration of All Ladder Lotteries

A ladder lottery, known as “Amidakuji” in Japan, is a common way to choose one winner or to make an assignment randomly in Japan. Formally, a ladder lottery L of a permutation π = (x1, x2, . . . , xn) is a network with n vertical lines (lines for short) and many horizontal lines (bars for short) connecting two consecutive vertical lines. The top ends of lines correspond to π. See Fig. 1. Each n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2021

ISSN: ['1879-2294', '0304-3975']

DOI: https://doi.org/10.1016/j.tcs.2021.01.009